0.08/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.14/0.19 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.19/0.40 % Computer : n027.cluster.edu 0.19/0.40 % Model : x86_64 x86_64 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.19/0.40 % Memory : 8042.1875MB 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64 0.19/0.40 % CPULimit : 1200 0.19/0.40 % WCLimit : 120 0.19/0.40 % DateTime : Tue Jul 13 15:37:40 EDT 2021 0.19/0.41 % CPUTime : 0.19/0.41 % Number of cores: 8 0.19/0.41 % Python version: Python 3.6.8 0.19/0.41 # Version: 2.6rc1-ho 0.28/0.43 # No SInE strategy applied 0.28/0.43 # Trying AutoSched0 for 59 seconds 0.49/0.66 # AutoSched0-Mode selected heuristic C07_19_nc_SOS_SAT001_MinMin_rr 0.49/0.66 # and selection function SelectMaxLComplexAvoidPosPred. 0.49/0.66 # 0.49/0.66 # Preprocessing time : 0.112 s 0.49/0.66 # Presaturation interreduction done 0.49/0.66 0.49/0.66 # Proof found! 0.49/0.66 # SZS status Theorem 0.49/0.66 # SZS output start CNFRefutation 0.49/0.66 thf(fact_0_old_Opath2__hd, axiom, ![X15:g, X16:node, X39:list_node, X17:node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X15 @ X16 @ X39 @ X17=>(X16)=(hd_node @ X39)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_old_Opath2__hd)). 0.49/0.66 thf(fact_30_FormalSSA__Misc_Odistinct__hd__tl, axiom, ![X767:list_node]:(~(member_node @ (hd_node @ X767) @ (set_node2 @ (tl_node @ X767)))<=distinct_node @ X767), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_30_FormalSSA__Misc_Odistinct__hd__tl)). 0.49/0.66 thf(conj_0, conjecture, ~(member_node @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ (set_node2 @ (tl_node @ rs))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.49/0.66 thf(fact_4_rs_H__props_I1_J, axiom, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ rs @ pred_phi_r, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_4_rs_H__props_I1_J)). 0.49/0.66 thf(fact_5_old_OEntryPath__distinct, axiom, ![X15:g, X39:list_node]:(graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ X15 @ X39=>distinct_node @ X39), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_5_old_OEntryPath__distinct)). 0.49/0.66 thf(fact_3_rs_H__props_I2_J, axiom, graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ g2 @ rs, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_rs_H__props_I2_J)). 0.49/0.66 thf(c_0_6, plain, ![X3550:g, X3551:node, X3552:list_node, X3553:node]:(~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3550 @ X3551 @ X3552 @ X3553|(X3551)=(hd_node @ X3552)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_old_Opath2__hd])])). 0.49/0.66 thf(c_0_7, plain, ![X767:list_node]:(distinct_node @ X767=>~member_node @ (hd_node @ X767) @ (set_node2 @ (tl_node @ X767))), inference(fof_simplification,[status(thm)],[fact_30_FormalSSA__Misc_Odistinct__hd__tl])). 0.49/0.66 thf(c_0_8, negated_conjecture, member_node @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ (set_node2 @ (tl_node @ rs)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.49/0.66 thf(c_0_9, plain, ![X5:node, X6:list_node, X15:g, X8:node]:((X5)=(hd_node @ X6)|~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X15 @ X5 @ X6 @ X8), inference(split_conjunct,[status(thm)],[c_0_6])). 0.49/0.66 thf(c_0_10, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ rs @ pred_phi_r, inference(split_conjunct,[status(thm)],[fact_4_rs_H__props_I1_J])). 0.49/0.66 thf(c_0_11, plain, ![X3260:g, X3261:list_node]:(~graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ X3260 @ X3261|distinct_node @ X3261), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_5_old_OEntryPath__distinct])])). 0.49/0.66 thf(c_0_12, plain, ![X3771:list_node]:(~distinct_node @ X3771|~member_node @ (hd_node @ X3771) @ (set_node2 @ (tl_node @ X3771))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])). 0.49/0.66 thf(c_0_13, negated_conjecture, member_node @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ (set_node2 @ (tl_node @ rs)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.49/0.66 thf(c_0_14, plain, (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r)=(hd_node @ rs), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.49/0.66 thf(c_0_15, plain, ![X15:g, X6:list_node]:(distinct_node @ X6|~graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ X15 @ X6), inference(split_conjunct,[status(thm)],[c_0_11])). 0.49/0.66 thf(c_0_16, plain, graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ g2 @ rs, inference(split_conjunct,[status(thm)],[fact_3_rs_H__props_I2_J])). 0.49/0.66 thf(c_0_17, plain, ![X6:list_node]:(~distinct_node @ X6|~member_node @ (hd_node @ X6) @ (set_node2 @ (tl_node @ X6))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.49/0.66 thf(c_0_18, negated_conjecture, member_node @ (hd_node @ rs) @ (set_node2 @ (tl_node @ rs)), inference(rw,[status(thm)],[c_0_13, c_0_14])). 0.49/0.66 thf(c_0_19, plain, distinct_node @ rs, inference(spm,[status(thm)],[c_0_15, c_0_16])). 0.49/0.66 thf(c_0_20, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])]), ['proof']). 0.49/0.66 # SZS output end CNFRefutation 0.49/0.66 # Proof object total steps : 21 0.49/0.66 # Proof object clause steps : 10 0.49/0.66 # Proof object formula steps : 11 0.49/0.66 # Proof object conjectures : 5 0.49/0.66 # Proof object clause conjectures : 3 0.49/0.66 # Proof object formula conjectures : 2 0.49/0.66 # Proof object initial clauses used : 6 0.49/0.66 # Proof object initial formulas used : 6 0.49/0.66 # Proof object generating inferences : 3 0.49/0.66 # Proof object simplifying inferences : 3 0.49/0.66 # Training examples: 0 positive, 0 negative 0.49/0.66 # Parsed axioms : 432 0.49/0.66 # Removed by relevancy pruning/SinE : 0 0.49/0.66 # Initial clauses : 956 0.49/0.66 # Removed in clause preprocessing : 97 0.49/0.66 # Initial clauses in saturation : 859 0.49/0.66 # Processed clauses : 1093 0.49/0.66 # ...of these trivial : 16 0.49/0.66 # ...subsumed : 101 0.49/0.66 # ...remaining for further processing : 976 0.49/0.66 # Other redundant clauses eliminated : 177 0.49/0.66 # Clauses deleted for lack of memory : 0 0.49/0.66 # Backward-subsumed : 1 0.49/0.66 # Backward-rewritten : 5 0.49/0.66 # Generated clauses : 382 0.49/0.66 # ...of the previous two non-trivial : 223 0.49/0.66 # Contextual simplify-reflections : 3 0.49/0.66 # Paramodulations : 245 0.49/0.66 # Factorizations : 0 0.49/0.66 # NegExts : 0 0.49/0.66 # Equation resolutions : 181 0.49/0.66 # Propositional unsat checks : 0 0.49/0.66 # Propositional check models : 0 0.49/0.66 # Propositional check unsatisfiable : 0 0.49/0.66 # Propositional clauses : 0 0.49/0.66 # Propositional clauses after purity: 0 0.49/0.66 # Propositional unsat core size : 0 0.49/0.66 # Propositional preprocessing time : 0.000 0.49/0.66 # Propositional encoding time : 0.000 0.49/0.66 # Propositional solver time : 0.000 0.49/0.66 # Success case prop preproc time : 0.000 0.49/0.66 # Success case prop encoding time : 0.000 0.49/0.66 # Success case prop solver time : 0.000 0.49/0.66 # Current number of processed clauses : 167 0.49/0.66 # Positive orientable unit clauses : 49 0.49/0.66 # Positive unorientable unit clauses: 0 0.49/0.66 # Negative unit clauses : 14 0.49/0.66 # Non-unit-clauses : 104 0.49/0.66 # Current number of unprocessed clauses: 663 0.49/0.66 # ...number of literals in the above : 2381 0.49/0.66 # Current number of archived formulas : 0 0.49/0.66 # Current number of archived clauses : 680 0.49/0.66 # Clause-clause subsumption calls (NU) : 111197 0.49/0.66 # Rec. Clause-clause subsumption calls : 21123 0.49/0.66 # Non-unit clause-clause subsumptions : 93 0.49/0.66 # Unit Clause-clause subsumption calls : 242 0.49/0.66 # Rewrite failures with RHS unbound : 0 0.49/0.66 # BW rewrite match attempts : 6 0.49/0.66 # BW rewrite match successes : 1 0.49/0.66 # Condensation attempts : 0 0.49/0.66 # Condensation successes : 0 0.49/0.66 # Termbank termtop insertions : 109753 0.49/0.66 0.49/0.66 # ------------------------------------------------- 0.49/0.66 # User time : 0.237 s 0.49/0.66 # System time : 0.016 s 0.49/0.66 # Total time : 0.253 s 0.49/0.66 # Maximum resident set size: 2856 pages 0.49/0.66 EOF